Decidable Properties for Regular Cellular Automata
نویسنده
چکیده
We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidable if we restrict to regular cellular automata.
منابع مشابه
Decidable and Computational properties of Cellular Automata (PhD Thesis)
In this thesis we investigate decidable and computational properties of Cellular Automata. This investigation is intended to be a contribute to the study of the more general theory of Complex Systems. A central interest in the sciences of complex systems is to understand the laws by which a global complex behavior can emerge for the collective interaction of simple components. Computation Theor...
متن کاملModel Checking One-Dimensional Cellular Automata
We show that the first order theory of a one-dimensional cellular automaton, construed as a structure with the global map and equality, is decidable. The argument employs bi-infinite versions of Büchi automata that can also be used to demonstrate that the spectra of cellular automata on finite grids are regular. For existential properties our method can be used to produce witnesses.
متن کاملDecidable Properties of Tree Languages
The first part of the thesis concerns problems related to the question: " when can a regular tree language be defined in first-order logic? " Characterizations in terms of automata of first-order logic and the related chain logic are presented. A decidable property of tree automata called confusion is introduced; it is conjectured that a regular tree language can be defined in chain logic if an...
متن کاملA Note on Decidability of Cellularity
A regular language L is said to be cellular if there exists a 1-dimensional cellular automaton CA such that L is the language consisting of the finite blocks associated with CA. It is shown that cellularity of a regular language is decidable using a new characterization of cellular languages formulated by Freiling, Goldstein and Moews and implied by a deep result of Boyle in symbolic dynamics.
متن کاملOn Decidability Properties of One-Dimensional Cellular Automata
In a recent paper Sutner proved that the first-order theory of the phase-space SA = (Q ,−→) of a one-dimensional cellular automaton A whose configurations are elements of Q, for a finite set of states Q, and where −→ is the “next configuration relation”, is decidable [Sut09]. He asked whether this result could be extended to a more expressive logic. We prove in this paper that this is actuallly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006